enumeration algorithmの例文

例文

1. This method was known already to 17th-century English change ringers, and calls it " perhaps the most prominent permutation enumeration algorithm ".
2. This relation may be used to generate the face lattice of an ( " n-1 " )-simplex efficiently, since face lattice enumeration algorithms applicable to general polytopes are more computationally expensive.
3. This algorithm, which is based on the exact enumeration algorithm " ESU ", has been implemented as an application called " FANMOD " . " RAND-ESU " is a NM discovery algorithm applicable for both directed and undirected networks, effectively exploits an unbiased node sampling throughout the network, and prevents overcounting sub-graphs more than once.